An Efficient Identity-based Signature from Lattice in the Random Oracle Model
نویسندگان
چکیده
We propose an efficient identity-based signature (IBS) scheme. The security of our scheme is proved in the random oracle model. Core technical components of our constructions are built on an arborist extends its control for a lattice to an arbitrary higher-dimensional extension. We use lattice's growth and lattice basis randomization securely to generate the user's secret key, and use trapdoor functions with preimage sampling to generate signature. Compared with the schemes based on factoring or discrete log, our scheme requires only linear operations on small integers except with larger public and secret keys. In particular, our scheme can resist quantum attack.
منابع مشابه
Provably secure and efficient identity-based key agreement protocol for independent PKGs using ECC
Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is ...
متن کاملRing Signature and Identity-Based Ring Signature from Lattice Basis Delegation
In this paper, we propose a set of ring signature (RS) schemes and identity-based ring signature (IBRS) schemes using the lattice basis delegation technique due to [10,22]. The schemes are unforgeable and hold anonymity in the random oracle model. Using the method in [28,29], we also extend our constructions to obtain RS and IBRS schemes in the standard model. Our proposed ring signature scheme...
متن کاملAn Efficient Identity-based Signcryption from Lattice
Signcryption is a cryptographic primitive that can provide valid solution for authentication and confidentiality. In this paper, an efficient identity-based signcryption scheme from lattice was proposed. Our scheme based on Macciancio and Piekert’s trapdoor generation method and delegate algorithm for lattice. Our main idea is that establish the identity-based system master key via trapdoor gen...
متن کاملEfficient forward secure identity-based shorter signature from lattice
All regular cryptographic schemes rely on the security of the secret key. However, with the explosive use of some relatively insecure mobile devices, the key exposure problem has become more aggravated. In this paper, we propose an efficient forward secure identitybased signature (FSIBS) scheme from lattice assumption, with its security based on the small integer solution problem (SIS) in the r...
متن کاملLattice-Based Ring Signature Scheme under the Random Oracle Model
Abstract: On the basis of the signatures scheme without trapdoors from lattice, which is proposed by Vadim Lyubashevsky in 2012, we present a new ring signature scheme from lattice. The proposed ring signature scheme is an extension of the signatures scheme without trapdoors. We proved that our scheme is strongly unforgeable against adaptive chosen message in the random oracle model, and proved...
متن کامل